Step of Proof: absval_wf
12,41
postcript
pdf
Inference at
*
1
I
of proof for Lemma
absval
wf
:
1.
x
:
if 0
z
x
then
x
else -
x
fi
latex
by
InteriorProof
((((BoolCasesOnCExp 0
z
x
)
CollapseTHENM (AbReduce 0))
)
CollapseTHEN (
CollapseTHEN (
(Auto_aux (first_nat 1:n) ((first_nat 2:n),(first_nat 3:n)) (first_tok SupInf:t
CollapseTHEN (
) inil_term)))
latex
C
.
Definitions
T
,
P
Q
,
P
&
Q
,
P
Q
,
P
Q
,
x
:
A
.
B
(
x
)
,
True
,
ff
,
if
b
then
t
else
f
fi
,
,
,
tt
,
t
T
,
Unit
,
,
Lemmas
assert
of
lt
int
,
bnot
of
le
int
,
true
wf
,
squash
wf
,
eqff
to
assert
,
assert
of
le
int
,
eqtt
to
assert
,
iff
transitivity
,
bnot
wf
,
lt
int
wf
,
le
wf
,
assert
wf
,
bool
wf
,
le
int
wf
origin